Non-convexly constrained linear inverse problems
نویسنده
چکیده
This paper considers the inversion of ill-posed linear operators. To regularise the problem the solution is enforced to lie in a non-convex subset. Theoretical properties for the stable inversion are derived and an iterative algorithm akin to the projected Landweber algorithm is studied. This work extends recent progress made on the efficient inversion of finite dimensional linear systems under a sparsity constraint to the Hilbert space setting and to more general non-convex constraints. Non-convexly constrained linear inverse problems 2
منابع مشابه
Convexly constrained linear inverse problems: iterative least-squares and regularization
| In this paper, we consider robust inversion of linear operators with convex constraints. We present an iteration that converges to the minimum norm least squares solution; a stopping rule is shown to regularize the constrained inversion. A constrained Laplace inversion is computed to illustrate the proposed algorithm.
متن کاملGeneralized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces
This paper studies a non-convexly constrained, sparse inverse problem in time-varying environments from a set theoretic estimation perspective. A new theory is developed that allows for the incorporation, in a unifying way, of different thresholding rules to promote sparsity, that may be even related to non-convex penalty functions. The resulted generalized thresholding operator is embodied in ...
متن کاملSingular constrained linear systems
In the linear system Ax = b the points x are sometimes constrained to lie in a given subspace S of column space of A. Drazin inverse for any singular or nonsingular matrix, exist and is unique. In this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of Drazin inverse in solving such systems is investigated. Constrained linear system arise ...
متن کاملPartially separable convexly-constrained optimization with non-Lipschitzian singularities and its complexity
An adaptive regularization algorithm using high-order models is proposed for partially separable convexly constrained nonlinear optimization problems whose objective function contains non-Lipschitzian `q-norm regularization terms for q ∈ (0, 1). It is shown that the algorithm using an p-th order Taylor model for p odd needs in general at most O( −(p+1)/p) evaluations of the objective function a...
متن کاملSolving a non-convex non-linear optimization problem constrained by fuzzy relational equations and Sugeno-Weber family of t-norms
Sugeno-Weber family of t-norms and t-conorms is one of the most applied one in various fuzzy modelling problems. This family of t-norms and t-conorms was suggested by Weber for modeling intersection and union of fuzzy sets. Also, the t-conorms were suggested as addition rules by Sugeno for so-called $lambda$–fuzzy measures. In this paper, we study a nonlinear optimization problem where the fea...
متن کامل